Identities for Schur Functions and Plane Partitions
نویسندگان
چکیده
By a plane partition, we mean a finite set, P , of lattice points with positive integer coefficients, {(i, j, k)} ⊆ N, with the property that if (r, s, t) ∈ P and 1 ≤ i ≤ r, 1 ≤ j ≤ s, 1 ≤ k ≤ t, then (i, j, k) must also be in P . A plane partition is symmetric if (i, j, k) ∈ P if and only if (j, i, k) ∈ P . The height of stack (i, j) is the largest value of k for which there exists a point (i, j, k) in the plane partition. A plane partition is column strict if the height of stack (i, j) is strictly less than the height of stack (i− 1, j) whenever i ≥ 2 and (i, j, 1) is in the plane partition. Symmetric plane partitions were studied by P. A. MacMahon [12] who conjectured in 1898 that the generating function for symmetric plane partitions with 1 ≤ i, j ≤ n and 1 ≤ k ≤ m is
منابع مشابه
Plane Partitions
Throughout our study of the enumeration of plane partitions we make use of bijective proofs to find generating functions. In particular, we consider bounded plane partitions, symmetric plane partitions and weak reverse plane partitions. Using the combinatorial interpretations of Schur functions in relation to semistandard Young tableaux, we rely on the properties of symmetric functions. In our ...
متن کاملShifted Schur Process and Asymptotics of Large Random Strict Plane Partitions
In this paper we define the shifted Schur process as a measure on sequences of strict partitions. This process is a generalization of the shifted Schur measure introduced in [TW] and [Mat] and is a shifted version of the Schur process introduced in [OR1]. We prove that the shifted Schur process defines a Pfaffian point process. We further apply this fact to compute the bulk scaling limit of the...
متن کاملPerfect sampling algorithm for Schur processes
We describe random generation algorithms for a large class of random combinatorial objects called Schur processes, which are sequences of random (integer) partitions subject to certain interlacing conditions. This class contains several fundamental combinatorial objects as special cases, such as plane partitions, tilings of Aztec diamonds, pyramid partitions and more generally steep domino tili...
متن کاملElementary Proofs of Identities for Schur Functions and Plane Partitions
By a plane partition, we mean a finite set, P , of lattice points with positive integer coefficients, {(i, j, k)} ⊆ N, with the property that if (r, s, t) ∈ P and 1 ≤ i ≤ r, 1 ≤ j ≤ s, 1 ≤ k ≤ t, then (i, j, k) must also be in P . A plane partition is symmetric if (i, j, k) ∈ P if and only if (j, i, k) ∈ P . The height of stack (i, j) is the largest value of k for which there exists a point (i,...
متن کاملElementary Proof of MacMahon’s Conjecture
Major Percy A. MacMahon’s first paper on plane partitions [4] included a conjectured generating function for symmetric plane partitions. This conjecture was proven almost simultaneously by George Andrews and Ian Macdonald, Andrews using the machinery of basic hypergeometric series [1] and Macdonald employing his knowledge of symmetric functions [3]. The purpose of this paper is to simplify Macd...
متن کامل